


class Solution:
    def findMin(self, nums: list[int]) -> int:
        self.min=nums[0]
        return self.plus(nums,0,len(nums)-1)
    def plus(self,nums, st, end):
        if st==end:
            return nums[st]
        if end-st==1:
            return min(nums[st],nums[end])
        middle=(st+end)/2
        middle=int(middle)
        if nums[middle]<nums[end]:
            return self.plus(nums,st,middle)
        else:
            return self.plus(nums,middle,end)